Semantic Matchmaking of Web Resources with Local Closed-World Reasoning

نویسندگان

  • Stephan Grimm
  • Pascal Hitzler
چکیده

Ontology languages like OWL allow for semantically rich annotation of resources, such as products advertised at an electronic online marketplace, while the Description Logic (DL) formalism underlying OWL provides reasoning techniques to perform matchmaking on such annotations. We identify peculiarities in the use of DL inferences for matchmaking which are due to the open-world semantics of OWL, and we analyse the use of local closed-world reasoning for its applicability to matchmaking. In particular, we investigate two nonmonotonic extensions to DL, namely autoepistemic DLs and DLs with circumscription, for their suitability of realising local closed-world reasoning in the matchmaking context to overcome these problems. We discuss their different characteristics by means of an elaborate example of an electronic marketplace for PC product catalogues from the eCommerce domain and demonstrate how these formalisms can be used to realise such scenarios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matching Semantic Service Descriptions with Local Closed-World Reasoning

Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the services explicitly, using semantic annotations. Such annotations can, for example, be used for service discovery—the task of locating a service capable of fulfilling a business request. In this paper, we present a framework for ...

متن کامل

Description Logics Approach to Semantic Matching of Web Services

As more resources and services become available on the Web, there is a growing need for infrastructures that, based on advertised descriptions, semantically match in a peer-to-peer way providers with requesters of web services. We address the problem of matchmaking of web services from a knowledge representation perspective. Based on our approach we propose match categorization in terms of exac...

متن کامل

Efficient Source Discovery and Service Composition for Ubiquitous Computing Environments

To be truly pervasive the devices in a ubiquitous computing environment have to be able to form a “coalition” without human intervention. The Semantic Web provides the infrastructure for discovery and composition of device functionalities. AI planning has been a popular technology for automatic service discovery and composition in the Semantic Web. However, because the Web is so vast and change...

متن کامل

Local Closed World Semantics: Keep it simple, stupid!

A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web applications. However, none of the proposals made to date for extending description logics with local closed world capabilities has had any significant impact on applications. We believe that one of the key reasons for t...

متن کامل

S-cbr: Semantic Case Based Reasoner for Web Services Discovery and Matchmaking

Web services are being increasingly adopted as the computing engine of choice for today’s Internet-driven applications. The composition of Web services further advances their advantages by allowing different services to integrate for providing new, value-added services. The automated discovery of adequate Web services is the pre-requisite and core feature for achieving dynamic Web services comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Electronic Commerce

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2007